A zero-one law for RP and derandomization of AM if NP is not small

نویسندگان

  • Russell Impagliazzo
  • Philippe Moser
چکیده

We show that if RP does not have p-measure zero then ZPP = EXP. As corollaries we obtain a zero-one law for RP in EXP, and that both probabilistic classes ZPP and RP have the same measure in EXP. We also prove that if NP does not have p-measure zero then NP = AM.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Easiness Assumptions and Hardness Tests : Trading Time for Zero

We propose a new approach towards derandomization in the uniform setting, where it is computationally hard to nd possible mistakes in the simulation of a given probabilistic algorithm. The approach consists in combining both easiness and hardness complexity assumptions: if a derandomization method based on an easiness assumption fails, then we obtain a certain hardness test that can be used to ...

متن کامل

Easiness Assumptions and Hardness Tests: Trading Time for Zero Error

We propose a new approach towards derandomization in the uniform setting, where it is computationally hard to find possible mistakes in the simulation of a given probabilistic algorithm. The approach consists in combining both easiness and hardness complexity assumptions: if a derandomization method based on an easiness assumption fails, then we obtain a certain hardness test that can be used t...

متن کامل

Nonlinear Guidance Law with Finite Time Convergence Considering Control Loop Dynamics

In this paper a new nonlinear guidance law with finite time convergence is proposed. The second order integrated guidance and control loop is formulated considering a first order control loop dynamics. By transforming the state equations to the normal form, a finite time stabilizer feedback linearization technique is proposed to guarantee the finite time convergence of the system states to zero...

متن کامل

The Complexity of Hardness Amplification and Derandomization

This thesis studies the interplay between randomness and computation. We investigate this interplay from the perspectives of hardness amplification and derandomization. Hardness amplification is the task of taking a function that is hard to compute on some input or on some fraction of inputs, and producing a new function that is very hard on average, i.e. hard to compute on a fraction of inputs...

متن کامل

Judicial Adjustment of Bipolar Patients' Crime with Social Justice Approach in Iranian Penal Law

Article 51 of the Islamic Penal Code of 2013 states that insanity while committing a crime at any stage shall be subject to criminal liability, but this substance has been implicated in insane people and its inclusion in bipolar patients has been controversial and the purpose of the study is to include it. The insanity must reach the trustees of the court. For bipolar patients, it is difficult ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Inf. Comput.

دوره 207  شماره 

صفحات  -

تاریخ انتشار 2009